Random Walk Graph Auto-Encoders With Ensemble Networks in Graph Embedding

نویسندگان

چکیده

Recently graph auto-encoders have received increasingly widespread attention as one of the important models in field deep learning. Existing auto-encoder only use convolutional neural networks (GCNs) encoders to learn embedding representation nodes. However, GCNs are suitable for transductive learning, poor scalability and shallow with a perceptual field, limitations node feature extraction. To alleviate these problems, we propose an adaptive weight integration network (GAT) GCN’s random walk (EGRWR-GAE) better There is large amount noise data, which interferes extraction GAT model sensitive noisy (EGSRWR-GAE) that integrates GAT, GCN, self-supervised (SuperGAT) using weights. The effectiveness our well demonstrated by three publicly available datasets (Cora, Citeseer, Pubmed) optimizations up 2.2% on link prediction task 12.9% clustering task.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variational Graph Auto-Encoders

Figure 1: Latent space of unsupervised VGAE model trained on Cora citation network dataset [1]. Grey lines denote citation links. Colors denote document class (not provided during training). Best viewed on screen. We introduce the variational graph autoencoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE) [2, 3]. This model ma...

متن کامل

Graph Embedding through Random Walk for Shortest Paths Problems

We present a new probabilistic technique of embedding graphs in Z, the d-dimensional integer lattice, in order to find the shortest paths and shortest distances between pairs of nodes. In our method the nodes of a breath first search (BFS) tree, starting at a particular node, are labeled as the sites found by a branching random walk on Z. After describing a greedy algorithm for routing (distanc...

متن کامل

Fast Random Walk Graph Kernel

Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it suffers from the expensive computational cost which is at least O(n) or O(m) for graphs with n nodes and m edges. In this paper, we propose Ark, a set of fast algorithms for random walk graph kernel computation. Ark is...

متن کامل

Image Representation Learning Using Graph Regularized Auto-Encoders

It is an important task to learn a representation for images which has low dimension and preserve the valuable information in original space. At the perspective of manifold, this is conduct by using a series of local invariant mapping. Inspired by the recent successes of deep architectures, we propose a local invariant deep nonlinear mapping algorithm, called graph regularized auto-encoder (GAE...

متن کامل

Embedding large graphs into a random graph

In this paper we consider the problem of embedding bounded degree graphs which are almost spanning in a random graph. In particular, let ∆ ≥ 5 and let H be a graph on (1−o(1))n vertices and with maximum degree ∆. We show that a random graph Gn,p with high probability contains a copy of H, provided that p (n−1 log n). Our assumption on p is optimal (including the powers in the log term) with res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3278271